Determinateness and Partitions
نویسندگان
چکیده
منابع مشابه
Determinateness and Partitions
It is proved that the axiom of determinateness of Mycielski and Steinhaus for games in which players alternate in writing reals implies that co -» (co)" (i-e. for every partition of infinite sets of natural numbers into two classes there is an infinite set such that all its infinite subsets belong to the same class). For every infinite N C co, fi(A/) denotes the family of infinite subsets of N....
متن کاملAxioms for Determinateness and Truth
A new formal theory DT of truth extending PA is introduced, whose language is that of PA together with one new unary predicate symbol T (x), for truth applied to Gödel numbers of suitable sentences in the extended language. Falsity of x , F(x), is defined as truth of the negation of x ; then, the formula D(x) expressing that x is the number of a determinate meaningful sentence is defined as the...
متن کاملAn extension of Painlevé’s determinateness theorem
In this paper we state and proof an extended version of Painlevé’s determinateness theorem . We study the C0−continuability along analytic arcs of solutions of some Cauchy’s problems, which will be ’multiple-valued’, i.e. defined on Riemann domains spread over C2.
متن کاملMonotone partitions and almost partitions
Article history: Received 28 April 2014 Received in revised form 14 October 2014 Accepted 14 October 2014 Available online 31 October 2014 MSC: 54D20
متن کاملEquitable Partitions and Orbit Partitions
We consider two kinds of partition of a graph, namely orbit partitions and equitable partitions. Although an orbit partition is always an equitable partition, the converse is not true in general. We look at some classes of graphs for which the converse is true.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1976
ISSN: 0002-9939
DOI: 10.2307/2040805